Non-associative, Non-commutative Multi-modal Linear Logic
نویسندگان
چکیده
Abstract Adding multi-modalities (called subexponentials ) to linear logic enhances its power as a logical framework, which has been extensively used in the specification of e.g. proof systems, programming languages and bigraphs. Initially, allowed for classical, linear, affine or relevant behaviors. Recently, this framework was enhanced so allow commutativity well. In work, we close cycle by considering associativity. We show that resulting system ( $$\mathsf {acLL}_\varSigma $$ acLL Σ admits (multi)cut rule, prove two undecidability results fragments/variations .
منابع مشابه
Non-Linear / Non-Commutative Non-Abelian Monopoles
Using recently proposed non-linearly realized supersymmetry in non-Abelian gauge theory corrected to O(α′), we derive the non-linear BPS equations in the background B-field for the U(2) monopoles and instantons. We show that these non-Abelian non-linear BPS equations coincide with the non-commutative anti-self-dual equations via the Seiberg-Witten map.
متن کاملA Non-commutative Extension of Classical Linear Logic
We extend the multiplicative fragment of linear logic with a non-commutative connective (called before), which, roughly speaking, corresponds to sequential composition. This lead us to a calculus where the conclusion of a proof is a Partially Ordered MultiSET of formulae. We rstly examine coherence semantics, where we introduce the before connective, and ordered products of formulae. Secondly w...
متن کاملA Non-commutative Extension of Multiplicative Exponential Linear Logic
We extend multiplicative exponential linear logic (MELL) by a noncommutative, self-dual logical operator. The extended system, called NEL, is defined in the formalism of the calculus of structures, which is a generalisation of the sequent calculus and provides a more refined analysis of proofs. We are then able to extend the expressiveness of MELL by modelling a broad notion of sequentiality. W...
متن کاملSimulating Computations in Second Order Non-Commutative Linear Logic
Lincoln, Scedrov and Shankar proved undecidability of intuitionistic second order multiplicative commutative linear logic by embedding LJ2 into this logic. Emms did the same for intuitionistic second order non-commutative linear logic. Recently, Lafont and Scedrov demonstrated undecidability of classical second order multiplicative commutative linear logic. As for classical second order non-com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-10769-6_27